A Downward Collapse within the Polynomial Hierarchy
نویسندگان
چکیده
Downward collapse (a.k.a. upward separation) refers to cases where the equality of two larger classes implies the equality of two smaller classes. We provide an unqualified downward collapse result completely within the polynomial hierarchy. In particular, we prove that, for k > 2, if P p
منابع مشابه
Translating Equality Downwards
Downward translation of equality refers to cases where a collapse of some pair of complexity classes would induce a collapse of some other pair of complexity classes that (a priori) one expects are smaller. Recently, the first downward translation of equality was obtained that applied to the polynomial hierarchy—in particular, to bounded access to its levels [HHH97]. In this paper, we provide a...
متن کاملDownward separation fails catastrophically for limited nondeterminism classes
The hierarchy consists of sets k = NPPlog k n] NP. Unlike collapses in the polynomial hierarchy and the Boolean hierarchy, collapses in the hierarchy do not seem to translate up, nor does closure under complement seem to cause the hierarchy to collapse. For any consistent set of collapses and separations of levels of the hierarchy that respects P = 1 2 NP, we can construct an oracle relative to...
متن کاملThe Boolean Hierarchy and the Polynomial Hierarchy: a Closer Connection
We show that if the Boolean hierarchy collapses to level k, then the polynomial hierarchy collapses to BH3(k), where BH3(k) is the k th level of the Boolean hierarchy over Σ2 . This is an improvement over the known results [3], which show that the polynomial hierarchy would collapse to P [O(log . This result is significant in two ways. First, the theorem says that a deeper collapse of the Boole...
متن کاملPolynomial Arithmetic 3
(1) Many typos have been corrected (2) Some redoundancy has been eliminated Notes on polynomially bounded arithmetic Abstract We characterize the collapse of Buss' bounded arithmetic in terms of the prov-able collapse of the polynomial time hierarchy. We include also some general model-theoretical investigations on fragments of bounded arithmetic.
متن کاملCollapsing Exact Arithmetic Hierarchies
We provide a uniform framework for proving the collapse of the hierarchy NC(C) for an exact arithmetic class C of polynomial degree. These hierarchies collapse all the way down to the third level of the AC-hierarchy, AC3(C). Our main collapsing exhibits are the classes C ∈ {C=NC,C=L,C=SAC,C=P}. NC(C=L) and NC(C=P) are already known to collapse [1,18,19]. We reiterate that our contribution is a ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- SIAM J. Comput.
دوره 28 شماره
صفحات -
تاریخ انتشار 1998